Additive Functions with Respect to Numeration Systems on Regular Languages

نویسندگان

  • PETER J. GRABNER
  • H. Delange
چکیده

Additive numeration systems and the corresponding additive arithmetic functions have been studied from various points of view since the seminal papers of H. Delange [4, 5], where such functions were investigated for the usual q-adic numeration system. Later more exotic systems of numeration, such as general linear numeration systems [13, 14], especially such systems defined by linear recurring sequences were considered. Furthermore, digital representations with respect to substitutions over a finite alphabet were studied (cf. [8, 9]). All these numeration systems have in common that the number of integers represented by words of length n satisfies a pure exponential law ∼ C for some constant C > 1. Different aspects of such representations of the integers were studied: dynamics of corresponding adding machine (“odometer”) [15], topological dynamics of the odometer [1], asymptotic properties of summatory functions of additive functions such as the “sumof-digits” function [8, 9, 12, 16, 17], local and global versions of central limit theorems for the values of additive functions [6, 7, 10], existence of distribution functions of additive functions [2]. In the present paper we take the opposite approach compared to the existing literature on the subject. We start with a regular language L, order its words by the genealogical ordering induced by an ordered alphabet, and assign the number n the (n+1)-st word in the language. The above mentioned expansions, which come from finite linear recurrences are special cases of this setting. For the question of recognizability of the language generated by an increasing sequence of integers we refer to [13, 20, 21]. The paper is organized as follows. In Section 2 we introduce the basic notation of numeration systems related to regular languages; for this purpose we summarize the contents of the paper [18]. In Section 3 we state the main theorem, which is the appropriate analogue of the summation formula for the sum-of-digits function discovered by H. Delange

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Sequences and Related Topics Suites Automatiques Et Sujets Reliés

numeration systems are a natural generalization of positional numeration systems whose set of representations of all the integers is a regular language. They were introduced five years ago by P. Lecomte and myself [3] and are defined in the following way. Consider any infinite regular language L over a totally ordered alphabet (A,<). An abstract numeration system is thus simply given by the tri...

متن کامل

Generalization of automatic sequences for numeration systems on a regular language

Let L be an infinite regular language on a totally ordered alphabet (Σ, <). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the output alphabet of the automaton. This process generalizes the concept of k-automatic sequence for abstract numeration systems on a regular language (instead of...

متن کامل

On Sets of Numbers Rationally Represented in a Rational Base Number System

In this work, it is proved that a set of numbers closed under addition and whose representations in a rational base numeration system is a rational language is not a finitely generated additive monoid. A key to the proof is the definition of a strong combinatorial property on languages : the bounded left iteration property. It is both an unnatural property in usual formal language theory (as it...

متن کامل

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...

متن کامل

Representing real numbers in a generalized numeration system

numeration systems An abstract numeration system (ANS) is given by a triplet S = (L,Σ, <) where L is a regular language over a totally ordered alphabet (Σ, <). By enumerating the words in L with respect to the radix order induced by <, we define a one-to-one correspondence: repS : N → L valS = rep −1 S : L → N. ANS: a generalization Most numeration systems satisfy the relation: m < n (usual ord...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011